Syntagma Processing for Incomplete Answers
نویسنده
چکیده
By trying to find a solution to incomplete answer processing, answers that are very frequent in a usual communication scenario based upon question-answer pattern, we developed an algorithm able to reconstruct the incomplete answer by using the question syntactical environment. Thus, one of the problem related to natural answers are the syntagmas. We call syntagma an incomplete answer that resumes to a phrase not to a grammatically correct sentence based on a subject and a verb. For example, if we consider the question ”What is your favorite color?”, most of the answers will be of the following form ”green”. Unfortunately, such an answer can’t usually be processed by using an English grammar. In our SPEL (Syntactic Parser for English Language) system, we have introduced an algorithm that is able to reconstruct the answers from the given syntagma and the initial question, without affecting the semantic information given by the answer.
منابع مشابه
Syntax-Semantics Interaction Parsing Strategies. Inside SYNTAGMA
This paper discusses SYNTAGMA, a rule based NLP system addressing the tricky issues of syntactic ambiguity reduction and word sense disambiguation as well as providing innovative and original solutions for constituent generation and constraints management. To provide an insight into how it operates, the system's general architecture and components, as well as its lexical, syntactic and semantic...
متن کاملAn Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملDeductive Databases with Incomplete Information
We consider query processing in deductive databases with incomplete information in the form of null values. We motivate the problem of extracting the maximal information from a (deductive) database in response to queries, and formalize this in the form of conditional answers. We give a sound and complete top-down proof procedure for generating conditional answers. We also extend the well-known ...
متن کاملQUERY PROCESSING OVER INCOMPLETE AUTONOMOUS WEB DATABASES by Hemal Khatri
Incompleteness due to missing attribute values (aka “null values”) is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query processing techniques that focus on the strict soundness of answer tuples often ignore tuples with critical missing attributes, even if they wind up being relevant to the user query. Ideally, the mediator...
متن کاملSYNTAGMA. A Linguistic Approach to Parsing
SYNTAGMA is a rule-based parsing system, structured on two levels: a general parsing engine and a language specific grammar. The parsing engine is a language independent program, while grammar and language specific rules and resources are given as text files, consisting in a list of constituent structures and a lexical database with word sense related features and constraints. Since its theoret...
متن کامل